On the Computation of the Kantorovich Distance for Images
نویسندگان
چکیده
We consider the theory and applications of the Kantorovich metric in fractal image compression. After surveying the most important approaches for its computation, we highlight its usefulness as a mathematical tool for comparing two images and improve its performance by means of more appropriate data structures.
منابع مشابه
Implementation of Face Recognition Algorithm on Fields Programmable Gate Array Card
The evolution of today's application technologies requires a certain level of robustness, reliability and ease of integration. We choose the Fields Programmable Gate Array (FPGA) hardware description language to implement the facial recognition algorithm based on "Eigen faces" using Principal Component Analysis. In this paper, we first present an overview of the PCA used for facial recognition,...
متن کاملBending Analysis of Rectangular FGM Plates based on the Extended Kantorovich Method
Bending analysis of FGM plates under uniform and sinusoidal loaded result in forth order partial differential equation. In this paper the analytical solution is based on the extended Kantorovich iterative procedure. The differential equations for the iterative procedure is derived using the Galerkin method. The solution was develope based on the classical plate’s theory (CLPT). The reliability ...
متن کاملEvaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملWasserstein Regularization of Imaging Problems
This paper introduces a novel and generic framework embedding statistical constraints for variational problems. We resort to the theory of Monge-Kantorovich optimal mass transport to define penalty terms depending on statistics from images. To cope with the computation time issue of the corresponding Wasserstein distances involved in this approach, we propose an approximate variational formulat...
متن کاملA Novel Trust Computation Method Based on User Ratings to Improve the Recommendation
Today, the trust has turned into one of the most beneficial solutions to improve recommender systems, especially in the collaborative filtering method. However, trust statements suffer from a number of shortcomings, including the trust statements sparsity, users' inability to express explicit trust for other users in most of the existing applications, etc. Thus to overcome these problems, this ...
متن کامل